Modeling and Verification of a Dynamic Information Structure Distributed Mutual Exclusion Algorithm Using Spin

In a distributed system, mutual exclusion is a condition which ensures that a shared resource in the system can be accessed by one and only one process at a time. Mutual exclusion ensures that only one process can be in its critical section at a time. Many distributed mutual exclusion algorithms have been proposed and verified [1][2][3][4][5]. In this paper, we have modeled and verified the dynamic information-structure mutual exclusion algorithm for distributed systems [1] using SPIN as the model checker. The algorithm is modeled in the Promela language which is interpreted using SPIN and the sequence diagrams corresponding to the model generated by SPIN are used to verify the correctness of the model.